Fully Decentralized and Collaborative Multilateration Primitives for Uniquely Localizing WSNs
نویسندگان
چکیده
We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and applies unique localization primitives on it. These primitives are based on constructing a special order for multilaterating the nodes within the cluster. The proposed primitives are fully collaborative and thus the number of iterations required to compute the localization is fewer than that of the conventional iterative multilateration approaches. This further limits the messaging requirements. With relatively small clusters and iteration counts, we can localize almost all the uniquely localizable nodes.
منابع مشابه
Event Invitations in Privacy-Preserving DOSNs - Formalization and Protocol Design
Online Social Networks (OSNs) have an infamous history of privacy and security issues. One approach to avoid the massive collection of sensitive data of all users at a central point is a decentralized architecture. An event invitation feature – allowing a user to create an event and invite other users who then can confirm their attendance – is part of the standard functionality of OSNs. We form...
متن کاملM-cluster and X-ray: Two methods for multi-jammer localization in wireless sensor networks
Jamming is one of the most severe attacks in wireless sensor networks (WSNs). While existing countermeasures mainly focus on designing new communication mechanisms to survive under jamming, a proactive solution is to first localize the jammer(s) and then take necessary actions. Unlike the existing work that focuses on localizing a single jammer in WSNs, this work solves a multi-jammer localizat...
متن کاملMultilateration: Methods For Clustering Intersection Points For Wireless Sensor Networks Localization With Distance Estimation Error
In this paper we describe three methods for localizing a wireless sensor network node, using anchor nodes in its neighbourhood, when there is an error in distance estimation present. We use the intersection points of the circles formed with the estimated distances from each anchors and we apply different methods to form clusters. We then use the cluster points to calculate the final position.
متن کاملDARE: evaluating Data Accuracy using node REputation
Typical wireless sensor networks (WSNs) applications are characterized by a certain number of different requirements such as: data accuracy, localization, reputation, security, and confidentiality. Moreover, being often battery powered, WSNs face the challenge of ensuring privacy and security despite power consumption limitations. When the application scenario allows their use, data aggregation...
متن کاملBilateration: An Attack-Resistant Localization Algorithm of Wireless Sensor Network
Most of the state-of-the-art localization algorithms in wireless sensor networks (WSNs) are vulnerable to attacks from malicious or compromised network nodes, whereas the secure localization schemes proposed so far are too complex to be applied to power constrained WSNs. This paper provides a novel secure scheme “Bilateration” which is derived from multilateration but can be calculated more acc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EURASIP J. Wireless Comm. and Networking
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010